Double Precedence Graphs
نویسندگان
چکیده
Reasoning on precedence relations is crucial for many planning and scheduling systems. In this paper we propose a double precedence graph where direct precedence relations are kept in addition to traditional precedence relations. By the direct precedence between activities A and B we mean that A directly precedes B (no activity is between A and B). We also show how these direct precedence relations can be used in incremental filtering of time windows and in introducing sequencedependent setup times between activities.
منابع مشابه
Incremental Maintenance of Double Precedence Graphs: A Constraint-Based Approach
Reasoning on precedence relations is crucial for many planning and scheduling systems. In this paper we propose a double precedence graph where direct precedence relations are kept additionally to traditional precedence relations (A can directly precede B if no activity must be allocated between A and B). Such precedence relations are motivated by solving problems like modelling sequence-depend...
متن کامل‘Strong’-‘Weak’ Precedence in Scheduling: Extended Order Implications
We examine computational complexity implications for scheduling problems with job precedence relations with respect to strong precedence versus weak precedence. We propose a consistent definition of strong precedence for chains, trees, and series parallel graphs. Using modular decomposition for partially ordered sets (posets), we restate and extend past complexity results for chains and trees a...
متن کاملLower Bound on the Number of Processors and Time for Scheduling Precedence Graphs with Communication Costs
In 1], Al-Mohummed proposed a method for evaluating a lower bound on the completion time and the number of processors required for scheduling precedence graphs with communication costs. In this note, we show that the method in 1] for evaluating a lower bound on the number of processors is incorrect. As a result, some precedence graphs can be feasibly scheduled using fewer processors than the lo...
متن کاملRegular Stream Flow Graphs 42 . 1 Operational Model of Regular Stream Flow
In this paper, we present a novel framework of multi-rate scheduling of signal processing programs represented by regular stream ow graphs (RSFGs). The main contribution of this paper is translating the scheduling problem of RSFGs into an equivalent problem in the domain of Karp-Miller computation graphs. A distinct feature of our scheduling framework | called multi-rate software pipelining | i...
متن کاملIntegration of RTL and precedence graphs with a static scheduler as verifier
In this paper we present an approach to speciication and veriication of distributed hard real-time systems. By integrating RTL and precedence constraints, we combine the comprehensiveness of precedence graphs with the expressive power and proofability of RTL. Thus, our approach allows easy comprehension by the human designer and formal correctness. We propose to use a static scheduling algorith...
متن کامل